//**********************************************************************************
// Klasse Node(Knoten) dient als Datenstruktur
//
//
//**********************************************************************************
package binarytree.model;


public class Node {

    public int data;
    public int value;
    public Node lS;
    public Node rS;

    public Node(int data) {
        this.data = data;
        lS = null;
        rS = null;
    }

    public boolean hasLS() {
        return null != lS;
    }

    public boolean hasRS() {
        return null != rS;
    }

    @Override
    public String toString() {
        return String.valueOf(data);
    }
    
    
}
